Parsing Dependency Grammar using ALE
نویسنده
چکیده
منابع مشابه
An improved joint model: POS tagging and dependency parsing
Dependency parsing is a way of syntactic parsing and a natural language that automatically analyzes the dependency structure of sentences, and the input for each sentence creates a dependency graph. Part-Of-Speech (POS) tagging is a prerequisite for dependency parsing. Generally, dependency parsers do the POS tagging task along with dependency parsing in a pipeline mode. Unfortunately, in pipel...
متن کاملImplementing Hpsg with Modular Tools for Fast Compiling and Parsing
We describe a modular HPSG implementation , based on a set of tools rather than a single monolithic engine such as ALE. With these tools we can use techniques for much faster compiling and parsing than ALE. We use two-stage grammar compilation with partial execution and a concurrent process implementation of the chart for fast parsing. We compile HPSG lexical rules into Prolog rules used at run...
متن کاملCross-Domain Dependency Parsing Using a Deep Linguistic Grammar
Pure statistical parsing systems achieves high in-domain accuracy but performs poorly out-domain. In this paper, we propose two different approaches to produce syntactic dependency structures using a large-scale hand-crafted HPSG grammar. The dependency backbone of an HPSG analysis is used to provide general linguistic insights which, when combined with state-of-the-art statistical dependency p...
متن کاملParsing Korean based on Dependency Grammar and GULP
This paper presents a parsing algorithm in Prolog using GULP, based on dependency grammar and unification-based grammar.1 It parses declarative sentences of a free-word-order language, Korean. The dependency grammar accepts free order of the words in a sentence. Unification-based features separate the grammar from the parsing algorithm and also simplify the notation of the grammar. GULP (Graph ...
متن کاملTransition-based dependency parsing as latent-variable constituent parsing
We provide a theoretical argument that a common form of projective transitionbased dependency parsing is less powerful than constituent parsing using latent variables. The argument is a proof that, under reasonable assumptions, a transition-based dependency parser can be converted to a latent-variable context-free grammar producing equivalent structures.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002